Improved Bounds for Perfect Systems of Difference Sets
نویسنده
چکیده
We give some improvements on the BKT inequality, an inequality for perfect systems of difference sets due to Bermond, Kotzig, and Turgeon, and consider, in particular, their implications for the critical case in which the BKT inequality holds with equality.
منابع مشابه
Complete forcing numbers of polyphenyl systems
The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...
متن کاملUniversal Approximation of Interval-valued Fuzzy Systems Based on Interval-valued Implications
It is firstly proved that the multi-input-single-output (MISO) fuzzy systems based on interval-valued $R$- and $S$-implications can approximate any continuous function defined on a compact set to arbitrary accuracy. A formula to compute the lower upper bounds on the number of interval-valued fuzzy sets needed to achieve a pre-specified approximation accuracy for an arbitrary multivariate con...
متن کاملIrregular Extremal Perfect Systems of Difference Sets
An {m, n;u, u;c)-system is a perfect system of difference sets with m components of size u— 1 and n components of size v— 1 having threshold c. A necessary condition for the existence of an (m, n; u, 6; c)system for u = 3 or 4 is that m ^ 2c— 1. We show that, in the extremal case when m = 2c— 1, there are (2c— 1, n; 3, 6; c)-systems for c ^ 3 when n = 1, and for c ^ 5 when n = 2, with a few pos...
متن کاملFurther results on irregular, critical perfect systems of difference sets I: split systems
Hamilton, G.M. and D.G. Rogers, Further results on irregular, critical perfect systems of difference sets I: split systems, Discrete Mathematics 102 (1992) 25-45. An (m, n; U, v; c)-system is a collection of components, m of valency u 1 and n of valency v 1, whose difference sets form a perfect system with threshold c. If there is an (m, n; 3, 6; c)-system, then m 22~ 1; and if there is a (2c 1...
متن کاملOn the Eccentric Connectivity Index of Unicyclic Graphs
In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Graphs and Combinatorics
دوره 9 شماره
صفحات -
تاریخ انتشار 1993